#include<bits/stdc++.h>

using namespace std;

const int mod = 998244353;

int n, m;
long long ans;

struct mat{
  long long a[210][210];
  mat operator *(mat x){
    mat c;
    for(int i = 1; i <= n; i++){
      for(int j = 1; j <= m; j++){
        c.a[i][j] = 0;
      }
    }
    for(int i = 1; i <= n; i++){
      for(int k = 1; k <= n; k++){
        for(int j = 1; j <= n; j++){
          c.a[i][j] = (c.a[i][j] + a[i][k] * x.a[k][j]) % mod;
        }
      }
    }
    return c;
  }
} A, S;

int main(){
  freopen("drama.in", "r", stdin);
  freopen("drama.out", "w", stdout);
  cin >> n >> m;
  for(int i = 1; i <= n; i++){
    S.a[i][i] = 1;
    A.a[i][i] = i - (i != n);
    if(i > 1) A.a[i][i - 1] = 1;
  }
  for(int i = 1; i <= m; i <<= 1){
    if(i & m) S = S * A;
    A = A * A;
  }
  for(int i = 1; i <= n; i++){
    ans = (ans + S.a[i][1]) % mod;
  }
  cout << ans << "\n";
  return 0;
}